Maximizing influence under influence loss constraint in social networks

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Mechanisms for Maximizing Influence in Social Networks

Throughout the past decade there has been extensive research on algorithmic and data mining techniques for solving the problem of influence maximization in social networks: if one can convince a subset of individuals to influence their friends to adopt a new product or technology, which subset should be selected so that the spread of influence in the social network is maximized? Despite the pro...

متن کامل

Maximizing the Speed of Influence in Social Networks

Influence maximization is the study of seed-node selection in a social network in order to achieve the maximized number of influenced nodes. Previous studies focused on three areas, i.e., designing propagation models, improving seed-node selection algorithms and exploiting the structure of social networks. However, most of these studies ignored the time constraint in influence propagation. Here...

متن کامل

Maximizing Social Influence in Nearly Optimal Time

Diffusion is a fundamental graph process, underpinning such phenomena as epidemic disease contagion and the spread of innovation by word-of-mouth. We address the algorithmic problem of finding a set of k initial seed nodes in a network so that the expected size of the resulting cascade is maximized, under the standard independent cascade model of network diffusion. Runtime is a primary consider...

متن کامل

Maximizing Influence in an Unknown Social Network

In many real world applications of influence maximization, practitioners intervene in a population whose social structure is initially unknown. This poses a multiagent systems challenge to act under uncertainty about how the agents are connected. We formalize this problem by introducing exploratory influence maximization, in which an algorithm queries individual network nodes (agents) to learn ...

متن کامل

Improving the influence under IC-N model in social networks

Huan Ma∗, Yuqing Zhu†, Deying Li∗¶, Donghyun Kim‡ and Jun Liang§ ∗School of Information, Renmin University of China Beijing 100872, P. R. China †Department of Computer Science California State University at Los Angeles Los Angeles, CA 90032, USA ‡Department of Mathematics and Physics North Carolina Central University Durham, NC 27707, USA §Department of Computer Science The University of Texas ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Expert Systems with Applications

سال: 2016

ISSN: 0957-4174

DOI: 10.1016/j.eswa.2016.01.008